Bond-propagation algorithm for thermodynamic functions in general two-dimensional Ising models
نویسندگان
چکیده
منابع مشابه
Bond-propagation algorithm for thermodynamic functions in general two-dimensional Ising models
Recently, we developed and implemented the bond-propagation algorithm for calculating the partition function and correlation functions of random-bond Ising models in two dimensions Y. L. Loh and E. W. Carlson, Phys. Rev. Lett. 97, 227205 2006 . The algorithm is the fastest available for calculating these quantities near the percolation threshold. In this paper, we show how to extend the bond-pr...
متن کاملCorrelation functions in the two-dimensional random-bond Ising model.
We consider long strips of finite width L ≤ 13 sites of ferromagnetic Ising spins with random couplings distributed according to the binary distribution: P (Jij) = 1 2(δ(Jij − J0) + δ(Jij − rJ0)), 0 < r < 1. Spin-spin correlation functions < σ0σR > along the “infinite” direction are computed by transfer-matrix methods, at the critical temperature of the corresponding two-dimensional system, and...
متن کاملEfficient algorithm for random-bond ising models in 2D.
We present an efficient algorithm for calculating the properties of Ising models in two dimensions, directly in the spin basis, without the need for mapping to fermion or dimer models. The algorithm computes the partition function and correlation functions at a single temperature on any planar network of N Ising spins in O(N;{3/2}) time or less. The method can handle continuous or discrete bond...
متن کاملRandomly Dilute Two Dimensional Ising Models
Calculations of the specific heat and magnetization of quenched, site‐diluted, N×N square and triangular Ising lattices have been carried out by a Monte Carlo method. For spin concentrations x of 0.8 and 0.9, lattices of size N=64 did not give sharp transitions. For a triangular lattice with N=128 and x=0.904, we found a well‐defined peak in the specific heat and an abrupt change in the magneti...
متن کاملA Two-Dimensional Genetic Algorithm for the Ising Problem
The genetic algorithm is a powerful heuristic for the solution of hard combinatorial problems and has been investigated by numer ous authors. Many problems, arising for example in communi. cation networks, possess stro ng two-dimensional characteristics. We describe a genetic algorit hm with a new crossover operator called block-uniform crossover, which exploits the two-dimensional character of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2007
ISSN: 1098-0121,1550-235X
DOI: 10.1103/physrevb.76.014404